NICE - New Ideal Coset Encryption
نویسندگان
چکیده
Recently, a new public-key cryptosystem constructed on number elds is presented. The prominent theoretical property of the public-key cryptosystem is a quadratic decryption bit complexity of the public key, which consists of only simple fast arithmetical operations. We call the cryptosystem NICE (New Ideal Coset Encryption). In this paper, we consider practical aspects of the NICE cryptosystem. Our implementation in software shows that the decryption time of NICE is comparably as fast as the encryption time of the RSA cryptosystem with e = 2 16 + 1. To show if existing smart cards can be used, we implemented the NICE cryptosystem using a smart card designed for the RSA cryptosystem. Our result shows that the decryption time of NICE is comparably as fast as the decryption time of RSA cryptosystem but not so fast as in software implementation. We discuss the reasons for this and indicate requirements for smartcard designers to achieve fast implementation on smartcards.
منابع مشابه
A survey of cryptosystems based on imaginary quadratic orders
Since nobody can guarantee that popular public key cryptosystems based on factoring or the computation of discrete logarithms in some group will stay secure forever, it is important to study different primitives and groups which may be utilized if a popular class of cryptosystems gets broken. A promising candidate for a group in which the DL-problem seems to be hard is the class group Cl(∆) of ...
متن کاملEfficient Implementation of Cryptosystems Based on Non-maximal Imaginary Quadratic Orders
In [14] there is proposed an ElGamal-type cryptosystem based on non-maximal imaginary quadratic orders with trapdoor decryption. The trapdoor information is the factorization of the non-fundamental discriminant ∆p = ∆1p . The NICE-cryptosystem (New Ideal Coset En-cryption) [24,12] is an efficient variant thereof, which uses an element g ∈ Ker(φ−1 Cl ) ⊆ Cl(∆p), where k is random and φ−1 Cl : Cl...
متن کاملOn the weak order ideal associated to linear codes
In this work we study a weak order ideal associated with the coset leaders of a non-binary linear code. This set allows the incrementally computation of the coset leaders and the definitions of the set of leader codewords. This set of codewords has some nice properties related to the monotonicity of the weight compatible order on the generalized support of a vector in F q which allows to descri...
متن کاملAn Efficient NICE-Schnorr-Type Signature Scheme
Recently there was proposed a novel public key cryptosystem [17] based on non-maximal imaginary quadratic orders with quadratic decryption time. This scheme was later on called NICE for New Ideal Coset Encryption [6]. First implementations show that the decryption is as efficient as RSA-encryption with e = 2 +1. It was an open question whether it is possible to construct comparably efficient si...
متن کاملToward Basing Fully Homomorphic Encryption on Worst-Case Hardness
Gentry proposed a fully homomorphic public key encryption scheme that uses ideal lattices. He based the security of his scheme on the hardness of two problems: an average-case decision problem over ideal lattices, and the sparse (or “low-weight”) subset sum problem (SSSP). We provide a key generation algorithm for Gentry’s scheme that generates ideal lattices according to a “nice” average-case ...
متن کامل